Confluence of Curried Term-Rewriting Systems
نویسندگان
چکیده
منابع مشابه
Confluence of Curried Term-Rewriting Systems
Reduction Systems Definition An Abstract Reduction System short ARS consists of a set A and a sequence i of binary relations on A labelled by some set I We often drop the label if I is a singleton We write A j P if the ARS A A i i I has the property P Further we write A j P Q i A j P and A j Q An ARS A A has the diamond property A j i It has the Church Rosser property is con uent A j CR i A j G...
متن کاملProving Confluence of Term Rewriting Systems Automatically
We have developed an automated confluence prover for term rewriting systems (TRSs). This paper presents theoretical and technical ingredients that have been used in our prover. A distinctive feature of our prover is incorporation of several divide–and–conquer criteria such as those for commutative (Toyama, 1988), layer-preserving (Ohlebusch, 1994) and persistent (Aoto & Toyama, 1997) combinatio...
متن کاملConfluence of Right Ground Term Rewriting Systems Is Decidable
Term rewriting systems provide a versatile model of computation. An important property which allows to abstract from potential nondeterminism of parallel execution of the modelled program is confluence. In this paper we prove that confluence of a fairly large class of systems, namely right ground term rewriting systems, is decidable. We introduce a labelling of variables with colours and constr...
متن کاملDisproving Confluence of Term Rewriting Systems by Interpretation and Ordering
In order to disprove confluence of term rewriting systems, we develop new criteria for ensuring non-joinability of terms based on interpretation and ordering. We present some instances of the criteria which are amenable for automation, and report on an implementation of a confluence disproving procedure based on these instances. The experiments reveal that our method is successfully applied to ...
متن کاملDeciding Confluence of Certain Term Rewriting Systems in Polynomial Time
We present a polynomial time algorithm for deciding confluence of ground term rewrite systems. We generalize the decision procedure to get a polynomial time algorithm, assuming that the maximum arity of a symbol in the signature is a constant, for deciding confluence of rewrite systems where each rule contains a shallow linear term on one side and a ground term on the other. The existence of a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Symbolic Computation
سال: 1995
ISSN: 0747-7171
DOI: 10.1006/jsco.1995.1035